One-shot Multiparty State Merging

نویسندگان

  • Nicolas Dutil
  • Patrick Hayden
چکیده

We present a protocol for performing state merging when multiple parties share a single copy of a mixed state, and analyze the entanglement cost in terms of minand maxentropies. Our protocol allows for interpolation between corner points of the rate region without the need for time-sharing, a primitive which is not available in the one-shot setting. We also compare our protocol to the more naive strategy of repeatedly applying a single-party merging protocol one party at a time, by performing a detailed analysis of the rates required to merge variants of the embezzling states. Finally, we analyze a variation of multiparty merging, which we call split-transfer, by considering two receivers and many additional helpers sharing a mixed state. We give a protocol for performing a split-transfer and apply it to the problem of assisted entanglement distillation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simultaneous min-entropy smoothing on multiparty systems

We consider the multiparty typicality conjecture raised by Dutil from a one-shot perspective. Asking for a multipartite state close to the state of the system that is typical on different subsystems simultaneously, this conjecture serves as a placeholder for the general difficulty to transfer the concept of classical joint typicality to the quantum setting. In this work, we reformulate the mult...

متن کامل

Near optimal bounds on quantum communication complexity of single-shot quantum state redistribution

We show near optimal bounds on the worst case quantum communication of single-shot entanglement-assisted one-way quantum communication protocols for the quantum state redistribution task and for the sub-tasks quantum state splitting and quantum state merging. Our bounds are tighter than previously known best bounds for the latter two sub-tasks. A key technical tool that we use is a convex-split...

متن کامل

Multiparty Session Types Meet Communicating Automata

Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in characterising essential properties of communications such as freedom from deadlock and communication error, and buffer boundedness. CFSMs are known to be computationally hard: most of these properties are undecidable even in r...

متن کامل

Video shot grouping using best-first model merging

For more efficiently organizing, browsing, and retrieving digital video, it is important to extract video structure information at both scene and shot levels. This paper presents an effective approach to video scene segmentation (shot grouping) based on probabilistic model merging. In our proposed method, we regard the shots in video sequence as hidden state variable and use probabilistic clust...

متن کامل

A Tool for Choreography-Based Analysis of Message-Passing Software

An appealing characteristic of choreographies is that they provide two complementary views of communicating software: the global and the local views. Communicating finite-state machines (CFSMs) have been proposed as an expressive formalism to specify local views. Global views have been represented with global graphs, that is graphical choreographies (akin to BPMN and UML) suitable to represent ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1011.1974  شماره 

صفحات  -

تاریخ انتشار 2010